Monotone Increasing Properties and Their Phase Transitions in Uniform Random Intersection Graphs
نویسندگان
چکیده
Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with n nodes is constructed as follows: each node selects a set of Kn different items uniformly at random from the same pool of Pn distinct items, and two nodes establish an undirected edge in between if and only if they share at least one item. For such graph denoted by G(n,Kn, Pn), we present the following results in this paper. First, we provide an exact analysis on the probabilities of G(n,Kn, Pn) having a perfect matching and having a Hamilton cycle respectively, under Pn = ω (
منابع مشابه
The Coupling Method for Inhomogeneous Random Intersection Graphs
We present new results concerning threshold functions for a wide family of random intersection graphs. To this end we improve and generalize the coupling method introduced for random intersection graphs so that it may be used for a wider range of parameters. Using the new approach we are able to tighten the best known results concerning random intersection graphs and establish threshold functio...
متن کاملPoisson convergence can yield very sharp transitions in geometric random graphs
We investigate how quickly phase transitions can occur in some geometric random graphs where n points are distributed uniformly and independently in the unit cube [0, 1] for some positive integer d. In the case of graph connectivity for the one-dimensional case, we show that the transition width behaves like n (when the number n of users is large), a significant improvement over general asympto...
متن کاملMagnetic Properties and Phase Transitions in a Spin-1 Random Transverse Ising Model on Simple Cubic Lattice
Within the effective-field theory with correlations (EFT), a transverse random field spin-1 Ising model on the simple cubic (z=6) lattice is studied. The phase diagrams, the behavior of critical points, transverse magnetization, internal energy, magnetic specific heat are obtained numerically and discussed for different values of p the concentration of the random transverse field.
متن کاملMonotone Paths in Random Hypergraphs
We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set N, the set of all increasing k-tuples in N. These graphs appear as line graph of uniform hypergraphs with vertex set N.
متن کاملOn k-Connectivity and Minimum Vertex Degree in Random s-Intersection Graphs
Random s-intersection graphs have recently received much interest in a wide range of application areas. Broadly speaking, a random s-intersection graph is constructed by first assigning each vertex a set of items in some random manner, and then putting an undirected edge between all pairs of vertices that share at least s items (the graph is called a random intersection graph when s = 1). A spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1502.00405 شماره
صفحات -
تاریخ انتشار 2015